Maximum Order of Triangle-Free Graphs with a Given Rank
نویسندگان
چکیده
The rank of a graph is defined to be the rank of its adjacency matrix. A graph is called reduced if it has no isolated vertices and no two vertices with the same set of neighbors. We determine the maximum order of reduced triangle-free graphs with a given rank and characterize all such graphs achieving the maximum order.
منابع مشابه
Bounds on the independence number of a graph in terms of order, size and maximum degree
• We prove several best-possible lower bounds in terms of the order and the average degree for the independence number of graphs which are connected and/or satisfy some odd girth condition. Our main result is the extension of a lower bound for the independence number of triangle-free graphs of maximum degree at most 3 due to Heckman and Thomas [A New Proof of the Independence Ratio of Triangle-...
متن کاملHow to decrease the diameter of triangle-free graphs
that h2(G)=Θ(n logn) for connected graphs of order n and of fixed maximum degree. The proof is based on relations of h2(G) and the clique-cover number of edges of graphs. It is also shown that the maximum value of h2(G) over (triangle-free) graphs of order n is dn/2− 1ebn/2− 1c. The behavior of h3(G) is different, its maximum value is n− 1. We could not decide whether h4(G)≤(1− )n for connected...
متن کاملIndependence, odd girth, and average degree
We prove several best-possible lower bounds in terms of the order and the average degree for the independence number of graphs which are connected and/or satisfy some odd girth condition. Our main result is the extension of a lower bound for the independence number of triangle-free graphs of maximum degree at most 3 due to Heckman and Thomas [A New Proof of the Independence Ratio of Triangle-Fr...
متن کاملRooted induced trees in triangle-free graphs
For a graph G, let t(G) denote the maximum number of vertices in an induced subgraph of G that is a tree. Further, for a vertex v ∈ V (G), let t(G, v) denote the maximum number of vertices in an induced subgraph of G that is a tree, with the extra condition that the tree must contain v. The minimum of t(G) (t(G, v), respectively) over all connected triangle-free graphs G (and vertices v ∈ V (G)...
متن کاملAn Exact Turán Result for Tripartite 3-Graphs
Mantel’s theorem says that among all triangle-free graphs of a given order the balanced complete bipartite graph is the unique graph of maximum size. We prove an analogue of this result for 3-graphs. Let K− 4 = {123, 124, 134}, F6 = {123, 124, 345, 156} and F = {K− 4 , F6}: for n 6= 5 the unique F-free 3-graph of order n and maximum size is the balanced complete tripartite 3-graph S3(n) (for n ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Graph Theory
دوره 79 شماره
صفحات -
تاریخ انتشار 2015